Topological properties of stock market networks: The case of Brazil

This paper investigates the topological properties of the Brazilian stock market networks. We build the minimum spanning tree, which is based on the concept of ultrametricity, using the correlation matrix for a variety of stocks of different sectors. Our results suggest that stocks tend to cluster by sector. We employ a dynamic approach using complex network measures and find that the relative importance of different sectors within the network varies. The financial, energy and material sectors are the most important within the network.     

Computing the minimal covering set

We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set–the minimal upward covering set and the minimal downward covering set–unless P equals NP. Finally, we observe a strong relationship between von Neumann–Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.     

Quasinormal subgroups of order p 2

The location of quasinormal subgroups in a group is not particularly well known. Maximal ones always have to be normal, but little has been proved about the minimal ones. In finite groups, the difficulties arise in the p-groups. Here we prove that, for every odd prime p, a quasinormal subgroup of order p ² in a finite p-group G contains a quasinormal subgroup of G of order p. S. Stonehewer is grateful to the Australian National University for financial support during the preparation of this paper.     

两类重要p-群及其自同构群的阶

In the paper we obtain two infinite classes of p-groups,calculate the orders of their automorphism groups and correct a mistake(perhaps misprinted)of Rodney James'paper in 1980.     

Minimal webs in Riemannian manifolds

For a given combinatorial graph G a geometrization (G, g) of the graph is obtained by considering each edge of the graph as a 1-dimensional manifold with an associated metric g. In this paper we are concerned with minimal isometric immersions of geometrized graphs (G, g) into Riemannian manifolds (N ⁿ , h). Such immersions we call minimal webs. They admit a natural ‘geometric’ extension of the intrinsic combinatorial discrete Laplacian. The geometric Laplacian on minimal webs enjoys standard properties such as the maximum principle and the divergence theorems, which are of instrumental importance for the applications. We apply these properties to show that minimal webs in ambient Riemannian spaces share several analytic and geometric properties with their smooth (minimal submanifold) counterparts in such spaces. In particular we use appropriate versions of the divergence theorems together with the comparison techniques for distance functions in Riemannian geometry and obtain bounds for the first Dirichlet eigenvalues, the exit times and the capacities as well as isoperimetric type inequalities for so-called extrinsic R-webs of minimal webs in ambient Riemannian manifolds with bounded curvature.      

Minimal surfaces over stars

A JS surface is a minimal graph over a polygonal domain that becomes infinite in magnitude at the domain boundary. Jenkins and Serrin characterized the existence of these minimal graphs in terms of the signs of the boundary values and the side-lengths of the polygon. For a convex polygon, there can be essentially only one JS surface, but a non-convex domain may admit several distinct JS surfaces. We consider two families of JS surfaces corresponding to different boundary values, namely JS₀ and JS₁, over domains in the form of regular stars. We give parameterizations for these surfaces as lifts of harmonic maps, and observe that all previously constructed JS surfaces have been of type JS₀. We give an example of a JS₁ surface that is a new complete embedded minimal surface generalizing Scherk's doubly periodic surface, and show also that the JS₀ surface over a regular convex 2n-gon is the limit of JS₁ surfaces over non-convex stars. Finally we consider the construction of other JS surfaces over stars that belong neither to JS₀ nor to JS₁.     

Minimal dissipation rate approach to correlate phase inversion data

Phase inversion refers to the phenomenon whereby a small change in operational flow conditions causes an oil-in-water dispersed flow pattern to suddenly switch to a water-in-oil flow pattern, and viceversa. This paper proposes an interpretation of phase inversion in terms of minimal dissipation rate. To this end, the dissipation rate is computed by a simple homogeneous model together with available correlations for effective viscosity in dispersed flows. It is shown that the data available in the literature can be reasonably interpreted as a manifestation of minimal dissipation rate. Furthermore, if the assumed effective viscosity correlations take into account pipe wettability, the minimal dissipation rate approach is capable to interpret also the so-called ambivalent range (hysteresis effect) and correlate the available data.     

Spectral radius, index estimates for Schrödinger operators and geometric applications

In this paper we study the existence of a first zero and the oscillatory behavior of solutions of the ordinary differential equation ^′(vz^′)+Avz=0, where A, v are functions arising from geometry. In particular, we introduce a new technique to estimate the distance between two consecutive zeros. These results are applied in the setting of complete Riemannian manifolds: in particular, we prove index bounds for certain Schrödinger operators, and an estimate of the growth of the spectral radius of the Laplacian outside compact sets when the volume growth is faster than exponential. Applications to the geometry of complete minimal hypersurfaces of Euclidean space, to minimal surfaces and to the Yamabe problem are discussed.